An Approach for Mixed Upward Planarization

An Approach for Mixed Upward Planarization

In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. We present a heuristic approach for this problem which provides good quality and reasonable running time in ...

Upward Planarization Layout

Abstract. Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straight-forward approaches for drawing such...

Upward planarization and layout

Drawing directed graphs has many applications and occurs whenever a natural flow of information is to be visualized. Given a directed acyclic graph (DAG) G, we are interested in an upward drawing of G, that is, a drawing of G in which all arcs are drawn as curves that are monotonically increasing in the vertical direction. Besides the upward property, it is desirable that the number of arc cros...

An Exact Approach to Upward Crossing Minimization

The upward crossing number problem asks for a drawing of the graph into the plane with the minimum number of edge crossings where the edges are drawn as monotonously increasing curves w.r.t. the y-axis. While there is a large body of work on solving this central graph drawing problem heuristically, we present the first approach to solve the problem to proven optimality. Our approach is based on...

An Approach for Solving Fuzzy Fredholm Integro-Difference Equations with Mixed Argument